A Note on Degenerate and Spectrally Degenerate Graphs
نویسنده
چکیده
A graph G is called spectrally d-degenerate if the largest eigenvalue of each subgraph of it with maximum degree D is at most √ dD. We prove that for every constant M there is a graph with minimum degree M which is spectrally 50-degenerate. This settles a problem of Dvořák and Mohar.
منابع مشابه
A note on critical point and blow-up rates for singular and degenerate parabolic equations
In this paper, we consider singular and degenerate parabolic equations$$u_t =(x^alpha u_x)_x +u^m (x_0,t)v^{n} (x_0,t),quadv_t =(x^beta v_x)_x +u^q (x_0,t)v^{p} (x_0,t),$$ in $(0,a)times (0,T)$, subject to nullDirichlet boundary conditions, where $m,n, p,qge 0$, $alpha, betain [0,2)$ and $x_0in (0,a)$. The optimal classification of non-simultaneous and simultaneous blow-up solutions is determin...
متن کاملConductivity Coefficient Modeling in Degenerate and Non-Degenerate Modes on GNSs
Carbon nanoscrolls (CNSs) with tubular structure similar to the open multiwall carbonnanotube have been of hot debate during recent years. Due to its unique property, Graphene Nanoscroll (GNS) have attracted many research groups’ attention and have been used by them. They specially studied on energy storage devices such as batteries and super capacitors. These devices can be schematically...
متن کاملQuantum current modelling on tri-layer graphene nanoribbons in limit degenerate and non-degenerate
Graphene is determined by a wonderful carrier transport property and high sensitivityat the surface of a single molecule, making them great as resources used in Nano electronic use.TGN is modeled in form of three honeycomb lattices with pairs of in-equivalent sites as {A1, B1},{A2, B2}, and {A3, B3} which are located in the top, center and bottom layers, respectively. Trilayer...
متن کاملSpectrally degenerate graphs: Hereditary case
It is well known that the spectral radius of a tree whose maximum degree is∆ cannot exceed 2 √ ∆− 1. Similar upper bound holds for arbitrary planar graphs, whose spectral radius cannot exceed √ 8∆+10, and more generally, for all d-degenerate graphs, where the corresponding upper bound is √ 4d∆. Following this, we say that a graph G is spectrally d-degenerate if every subgraph H of G has spectra...
متن کاملA new network simplex algorithm to reduce consecutive degenerate pivots and prevent stalling
It is well known that in operations research, degeneracy can cause a cycle in a network simplex algorithm which can be prevented by maintaining strong feasible bases in each pivot. Also, in a network consists of n arcs and m nodes, not considering any new conditions on the entering variable, the upper bound of consecutive degenerate pivots is equal $left( begin{array}{c} n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 72 شماره
صفحات -
تاریخ انتشار 2013